Probabilistic recurrence relations revisited
نویسندگان
چکیده
منابع مشابه
( Probabilistic ) Recurrence Relations
The performance attributes of a broad class of randomised algorithms can be described by a recurrence relation of the form T(x) = a(x)+T(H(x)), where a is a function and H(x) is a random variable. For instance, T(x) may describe the running time of such an algorithm on a problem of size x. Then T(x) is a random variable, whose distribution depends on the distribution of H(x). To give high proba...
متن کاملThe Solution of Linear Probabilistic Recurrence Relations 1
Linear probabilistic divide-and-conquer recurrence relations arise when analyzing the running time of divide-and-conquer randomized algorithms. We consider first the problem of finding the expected value of the random process T (x), described as the output of a randomized recursive algorithm T . On input x , T generates a sample (h1, . . . , hk) from a given probability distribution on [0, 1]k ...
متن کاملProbabilistic Recurrence Relations for Work and Span of Parallel Algorithms
In this paper we present a method for obtaining tail-bounds for random variables satisfying certain probabilistic recurrences that arise in the analysis of randomized parallel divide and conquer algorithms. In such algorithms, some computation is initially done to process an input x, which is then randomly split into subproblems h1(x), . . . , hn(x), and the algorithm proceeds recursively in pa...
متن کاملProbabilistic Relations
The notion of binary relation is fundamental in logic. What is the correct analogue of this concept in the probabilistic case? I will argue that the notion of conditional probability distribution (Markov kernel, stochastic kernel) is the correct generalization. One can deene a category based on stochastic kernels which has many of the formal properties of the ordinary category of relations. Usi...
متن کاملXyView: Universal Relations Revisited
We present XyView, a practical solution for fast development of user(web forms) and machine-oriented applications (web services) over a repository of heterogeneous schema-free XML documents. XyView provides the means to view such a repository as an array that can be queried using a QBE-like interface or through simple selection/projection queries. It extends the concept of universal relations i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1997
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(96)00261-7